Approximation algorithms for the joint replenishment problem with deadlines
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Joint Replenishment Problem with Deadlines
The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supplychain management, concerned with optimizing the flow of goods from a supplier to retailers. Over time, in response to demands at the retailers, the supplier ships orders, via a warehouse, to the retailers. The objective is to schedule these orders to minimize the sum of ordering costs and retailers’ waiting cos...
متن کاملApproximating the Joint replenishment Problem with Deadlines
The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse. These orders are needed to satisfy demands that appear over time at the retailers. We investigate the natural special case that each demand has a deadline until when it needs to be satisfied. For this case, we present...
متن کاملApproximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
In the Joint Replenishment Problem (JRP), the goal is to coordinate the replenishments of a collection of goods over time so that continuous demands are satisfied with minimum overall ordering and holding costs. We consider the case when demand rates are constant. Our main contribution is the first hardness result for any variant of JRP with constant demands. When replenishments per commodity a...
متن کاملBetter Approximation Bounds for the Joint Replenishment Problem
The Joint Replenishment Problem (JRP) deals with optimizing shipments of goods from a supplier to retailers through a shared warehouse. Each shipment involves transporting goods from the supplier to the warehouse, at a fixed cost C, followed by a redistribution of these goods from the warehouse to the retailers that ordered them, where transporting goods to a retailer ρ has a fixed cost cρ. In ...
متن کاملModels and Algorithms for the Dynamic-demand Joint Replenishment Problem
This paper deals with the problem of coordinated ordering of items having deterministic but time varying demands where there is a common ordering cost if one or more of these items are ordered in addition to individual items ordering costs. To solve this NP-hard problem we propose a number of heuristics. Also we report on a comparative study that we undertaken to evaluate the relative performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2014
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-014-0392-y